Mathematical Programming for Lot Sizing and Production Scheduling in Foundries
نویسندگان
چکیده
منابع مشابه
Lot sizing and furnace scheduling in small foundries
A lot sizing and scheduling problem prevalent in small market-driven foundries is studied. There are two related decision levels: (1) the furnace scheduling of metal alloy production, and (2) moulding machine planning which specifies the type and size of production lots.Amixed integer programming (MIP) formulation of the problem is proposed, but is impractical to solve in reasonable computing t...
متن کاملOptimal Production Scheduling and Lot-sizing In Yoghurt Production Lines
The lot-sizing and production scheduling problem in a real-life multi-product yoghurt production line is addressed. A new discrete/continuous time representation mixedinteger linear programming model, based on the definition of families of products, is presented. It is mainly optimized the packaging stage while timing and capacity constraints are imposed with respect to the pasteurization/homog...
متن کاملSimultaneous Lot Sizing and Scheduling in a Flexible Flow Line
This paper breaks new ground by modelling lot sizing and scheduling in a flexible flow line (FFL) simultaneously instead of separately. This problem, called the ‘General Lot sizing and Scheduling Problem in a Flexible Flow Line’ (GLSP-FFL), optimizes the lot sizing and scheduling of multiple products at multiple stages, each stage having multiple machines in parallel. The objective is to satisf...
متن کاملEconomic Lot Sizing and Scheduling in Distributed Permutation Flow Shops
This paper addresses a new mixed integer nonlinear and linear mathematical programming economic lot sizing and scheduling problem in distributed permutation flow shop problem with number of identical factories and machines. Different products must be distributed between the factories and then assignment of products to factories and sequencing of the products assigned to each factory has to be d...
متن کاملA Mathematical Programming Model for Flow Shop Scheduling Problems for Considering Just in Time Production
In this paper, we consider a flow shop scheduling problem with bypass consideration for minimizing the sum of earliness and tardiness costs. We propose a new mathematical modeling to formulate this problem. There are several constraints which are involved in our modeling such as the due date of jobs, the job ready times, the earliness and the tardiness cost of jobs, and so on. We apply adapte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archives of Foundry Engineering
سال: 2014
ISSN: 2299-2944
DOI: 10.2478/afe-2014-0053